package leetcode.动态规划;

import org.junit.Test;

/**
 * @author :songyaozhang
 * @date :Created 2021/8/16 15:34
 * @description :
 */
public class 爬楼梯 {
    @Test
    public void test() {
        Solution solution = new Solution();
        System.out.println(solution.climbStairs(3));
    }

    class Solution {
        public int climbStairs(int n) {
            if (n == 0) return 0;
            if (n == 1) return 1;
            int[] dp = new int[n + 1];
            dp[1] = 1;
            dp[2] = 2;
            for (int i = 3; i <= n; i++) {
                dp[i] = dp[i - 1] + dp[i - 2];
            }
            return dp[n];
        }
    }
}
